Nearly orthogonal vectors and small antipodal spherical codes

نویسندگان

  • Boris Bukh
  • Christopher Cox
چکیده

How can d+k vectors in R be arranged so that they are as close to orthogonal as possible? In particular, define θ(d, k) := minX maxx 6=y∈X |〈x, y〉| where the minimum is taken over all collections of d + k unit vectors X ⊆ R. In this paper, we focus on the case where k is fixed and d → ∞. In establishing bounds on θ(d, k), we find an intimate connection to the existence of systems of ( k+1 2 ) equiangular lines in R. Using this connection, we are able to pin down θ(d, k) whenever k ∈ {1, 2, 3, 7, 23} and establish asymptotics for general k. The main tool is an upper bound on Ex,y∼μ|〈x, y〉| whenever μ is an isotropic probability mass on R, which may be of independent interest. Our results translate naturally to the analogous question in C. In this case, the question relates to the existence of systems of k equiangular lines in C, also known as SIC-POVM in physics literature.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Improved Linear Programming Bounds for Antipodal Spherical Codes

Let S ?1; 1). A nite set C = fx i g M i=1 < n is called a spherical S-code if kx i k = 1 for each i, and x T i x j 2 S, i 6 = j. For S = ?1; :5] maximizing M = jCj is commonly referred to as the kissing number problem. A well-known technique based on harmonic analysis and linear programming can be used to bound M. We consider a modiication of the bounding procedure that is applicable to antipod...

متن کامل

On maximal antipodal spherical codes with few distances

Using linear programming techniques we derive bounds for antipodal spherical codes. The possibilities for attaining our bounds are investigated and Lloyd-type theorems are proved.

متن کامل

Performance Analysis of MAP Decoded Space-Time Orthogonal Block Codes for Non-Uniform Sources*

We derive a closed-form expression for the exact pairwise error probability (PEP) of a non-uniform memoryless binary source transmitted over a Rayleigh fading channel using space-time orthogonal block codes and maximum a posteriori (MAP) detection. The expression is easy to evaluate and holds for any signaling scheme. We then use this result to minimize the bit error rate of the binary antipoda...

متن کامل

Weighing matrices and spherical codes

Mutually unbiased weighing matrices (MUWM) are closely related to an antipodal spherical code with 4 angles. In this paper, we clarify the relation between MUWM and the spherical codes, and determine the maximum size of a set of MUWM with weight 4 for any order. Moreover, we define mutually quasi-unbiased weighing matrices (MQUWM) as a natural generalization of MUWM from the viewpoint of spheri...

متن کامل

Enhance Orthogonal Code Convolution Capabilities for Efficient Digital Communication

Real time transmission of data at high bit rates is one of the increasing demands today. This has inadvertently made data susceptible to noise resulting in impairment during transmission. In this paper, Orthogonal Codes have been developed and realized using Xilinx software for efficient digital communication for not only can they detect and correct errors but also do away with the requirement ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2018